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 28, 2026 09:07TudyMTudyMScore: 34,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:0834,605305,280,168286,226,0001,000,0002,387,968
2Apr 28, 2026 09:0834,614301,038,296285,302,0002,002,0002,379,776
3Apr 28, 2026 09:0834,628306,183,423285,411,0002,002,0002,383,872
4Apr 28, 2026 09:0834,630306,682,063286,436,0001,001,0002,383,872
5Apr 28, 2026 09:0834,631307,028,018287,438,00002,306,048
6Apr 28, 2026 09:0834,632305,921,569287,448,00002,387,968
7Apr 28, 2026 09:0834,637303,886,187285,489,0002,003,0002,387,968
8Apr 28, 2026 09:0834,640307,204,764285,524,0001,996,0002,392,064
9Apr 28, 2026 09:0834,644304,941,105286,545,0001,001,0002,379,776