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 20, 2026 17:30Victor MerckléVictor MerckléScore: 4,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:314,96951,552,61340,200,0001,049,0002,113,536
2May 20, 2026 17:314,97051,311,56040,200,0001,059,0002,113,536
3May 20, 2026 17:314,97249,076,15240,220,0001,053,0002,113,536
4May 20, 2026 17:314,97352,060,09340,232,0001,052,0002,113,536
5May 20, 2026 17:314,98550,534,18240,351,0001,028,0002,113,536
6May 20, 2026 17:314,99050,907,37440,419,0001,002,0002,113,536
7May 20, 2026 17:314,99650,754,93340,439,0001,034,0002,113,536
8May 20, 2026 17:315,08050,741,72441,151,0001,016,0002,113,536
9May 20, 2026 17:315,08051,319,15241,137,0001,035,0002,113,536