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 listAug 21, 2026 00:18Andrew EpsteinAndrew EpsteinScore: 6,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 00:185,96459,312,38248,374,0001,128,0002,113,536
2Aug 21, 2026 00:185,96659,338,00648,386,0001,137,0002,113,536
3Aug 21, 2026 00:185,96959,306,04648,426,0001,117,0002,113,536
4Aug 21, 2026 00:185,97059,386,33248,431,0001,123,0002,113,536
5Aug 21, 2026 00:186,03259,894,99548,948,0001,123,0002,113,536
6Aug 21, 2026 00:186,03359,959,69448,966,0001,114,0002,113,536
7Aug 21, 2026 00:186,04161,034,35249,015,0001,129,0002,113,536
8Aug 21, 2026 00:186,10560,483,59349,558,0001,115,0002,113,536
9Aug 21, 2026 00:186,16460,843,02550,046,0001,122,0002,113,536