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 24, 2026 07:53Charles CabergsCharles CabergsScore: 20,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 07:5519,659182,280,316162,173,0001,001,0002,371,584
2Apr 24, 2026 07:5519,779184,468,089162,168,0002,002,0002,363,392
3Apr 24, 2026 07:5519,894184,450,787163,135,0001,989,0002,367,488
4Apr 24, 2026 07:5520,058182,107,787165,484,0001,002,0002,367,488
5Apr 24, 2026 07:5520,089185,900,199164,746,0001,996,0002,359,296
6Apr 24, 2026 07:5520,091188,075,025164,766,0001,997,0002,375,680
7Apr 24, 2026 07:5520,344187,499,746166,860,0001,998,0002,461,696
8Apr 24, 2026 07:5520,362183,827,251167,010,0002,000,0002,371,584
9Apr 24, 2026 07:5520,373185,429,331167,095,0002,001,0002,363,392