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 26, 2026 03:03Charles CabergsCharles CabergsScore: 17,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:0317,222163,128,146140,951,0001,999,0002,363,392
2Apr 26, 2026 03:0317,255161,454,933142,218,0001,001,0002,363,392
3Apr 26, 2026 03:0317,265161,453,348142,305,0001,002,0002,367,488
4Apr 26, 2026 03:0317,306163,727,172141,652,0001,995,0002,363,392
5Apr 26, 2026 03:0317,307163,685,710141,657,0001,995,0002,367,488
6Apr 26, 2026 03:0317,350162,374,349143,013,0001,000,0002,433,024
7Apr 26, 2026 03:0317,936165,391,459146,876,0001,998,0002,306,048
8Apr 26, 2026 03:0317,947167,506,267146,962,0001,999,0002,367,488
9Apr 26, 2026 03:0317,962163,993,818148,085,0001,000,0002,363,392