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 listFeb 19, 2026 17:26Daniel MastalerzDaniel MastalerzScore: 6,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 17:266,00471,345,23842,712,0007,118,0002,322,432
2Feb 19, 2026 17:266,01772,512,82439,950,0009,987,0002,363,392
3Feb 19, 2026 17:266,08477,549,42641,410,0009,090,0002,461,696
4Feb 19, 2026 17:266,40080,928,60944,101,0009,020,0002,465,792
5Feb 19, 2026 17:266,46681,537,33543,539,00010,125,0002,392,064
6Feb 19, 2026 17:266,50480,270,98645,984,0007,997,0002,519,040