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 listMar 10, 2026 18:57Sergey SerebryakovSergey SerebryakovScore: 7,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:577,54588,494,73862,621,00002,273,280
2Mar 10, 2026 18:577,54589,242,20662,623,00002,273,280
3Mar 10, 2026 18:577,55188,359,87760,688,0001,989,0002,273,280
4Mar 10, 2026 18:577,90591,785,08864,602,0001,009,0002,387,968
5Mar 10, 2026 18:577,90690,340,63364,614,0001,009,0002,404,352
6Mar 10, 2026 18:577,90993,373,04364,637,0001,009,0002,404,352
7Mar 10, 2026 18:577,91091,032,11464,642,0001,010,0002,273,280
8Mar 10, 2026 18:577,92092,081,68264,737,000995,0002,273,280
9Mar 10, 2026 18:577,92294,862,63164,756,000996,0002,273,280
10Mar 10, 2026 18:577,92291,375,77964,759,000996,0002,273,280
11Mar 10, 2026 18:577,92890,850,81164,803,000996,0002,506,752
12Mar 10, 2026 18:577,92896,951,74463,808,0001,994,0002,400,256