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 22:23wnwnScore: 5,811Success
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 22:235,69571,295,19246,260,0001,005,0002,449,408
2Feb 18, 2026 22:235,70069,080,76347,307,00002,273,280
3Feb 18, 2026 22:235,71574,400,88945,418,0002,018,0002,273,280
4Feb 18, 2026 22:225,79167,903,60146,067,0002,002,0002,510,848
5Feb 18, 2026 22:225,81175,843,92046,220,0002,009,0002,539,520
6Feb 18, 2026 22:235,91576,623,77448,095,0001,001,0002,535,424
7Feb 18, 2026 22:235,92472,188,44748,166,0001,003,0002,449,408
8Feb 18, 2026 22:235,93372,224,34048,239,0001,004,0002,535,424
9Feb 18, 2026 22:225,94967,210,93049,375,00002,514,944