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 listMay 5, 2026 08:00M-RochatM-RochatScore: 32,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 08:0032,877291,868,836271,856,0001,030,0002,383,872
2May 5, 2026 08:0032,881286,729,370271,800,0001,115,0002,387,968
3May 5, 2026 08:0032,884291,088,670271,840,0001,103,0002,392,064
4May 5, 2026 08:0032,890289,322,753271,955,0001,038,0002,379,776
5May 5, 2026 08:0032,912288,785,217272,131,0001,045,0002,379,776
6May 5, 2026 08:0032,924291,609,223272,231,0001,041,0002,379,776
7May 5, 2026 08:0032,934290,346,333272,341,0001,014,0002,314,240
8May 5, 2026 08:0032,962291,905,769272,493,0001,094,0002,379,776
9May 5, 2026 08:0033,412294,533,243276,282,0001,039,0002,371,584