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 listApr 1, 2026 00:45zielajzielajScore: 3,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 00:453,42355,481,11827,400,0001,014,0002,519,040
2Apr 1, 2026 00:443,52849,284,57828,274,0001,009,0002,433,024
3Apr 1, 2026 00:443,57754,255,21028,663,0001,023,0002,428,928
4Apr 1, 2026 00:443,60455,198,63127,920,0001,994,0002,424,832
5Apr 1, 2026 00:453,62153,139,81828,054,0002,003,0002,510,848
6Apr 1, 2026 00:453,62251,974,14128,060,0002,004,0002,473,984