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 listJun 26, 2026 11:17Victor MerckléVictor MerckléScore: 4,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 11:184,59945,854,75437,088,0001,084,0002,113,536
2Jun 26, 2026 11:184,60145,850,37437,111,0001,083,0002,113,536
3Jun 26, 2026 11:184,61245,973,61937,235,0001,052,0002,113,536
4Jun 26, 2026 11:184,62946,058,75137,391,0001,035,0002,113,536
5Jun 26, 2026 11:184,63946,202,15637,420,0001,088,0002,113,536
6Jun 26, 2026 11:184,64446,191,73037,509,0001,040,0002,113,536
7Jun 26, 2026 11:184,65146,687,40737,497,0001,112,0002,113,536
8Jun 26, 2026 11:184,71546,836,51438,060,0001,078,0002,113,536
9Jun 26, 2026 11:184,72146,940,04438,097,0001,088,0002,113,536