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 15, 2026 20:19wnwnScore: 11,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 20:2210,895112,088,19481,387,0009,043,0002,437,120
2Feb 15, 2026 20:2210,983118,891,64784,151,0007,012,0002,465,792
3Feb 15, 2026 20:2211,005123,261,98383,310,0008,029,0002,457,600
4Feb 15, 2026 20:2211,058121,621,19383,799,0007,980,0002,441,216
5Feb 15, 2026 20:2211,063114,490,45280,841,00010,978,0002,461,696
6Feb 15, 2026 20:2211,067114,884,92182,874,0008,986,0002,293,760
7Feb 15, 2026 20:2211,145122,628,71585,463,0007,038,0002,387,968
8Feb 15, 2026 20:2211,158121,452,86285,569,0007,046,0002,449,408
9Feb 15, 2026 20:2211,296120,713,91185,776,0007,979,0002,457,600