Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 18, 2026 23:42wnwnScore: 5,815Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:425,73871,310,97347,627,00002,531,328
2Feb 18, 2026 23:425,76377,655,45945,843,0001,993,0002,445,312
3Feb 18, 2026 23:425,76768,338,56244,871,0002,991,0002,445,312
4Feb 18, 2026 23:425,81573,451,45447,256,0001,005,0002,441,216
5Feb 18, 2026 23:425,91972,574,63645,119,0004,010,0002,437,120
6Feb 18, 2026 23:425,95069,582,78147,372,0002,015,0002,273,280