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 23, 2026 18:39wnwnScore: 4,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 18:404,37364,452,89435,285,0001,008,0002,273,280
2Feb 23, 2026 18:394,38955,352,33835,417,0001,011,0002,498,560
3Feb 23, 2026 18:404,41361,135,17535,613,0001,017,0002,535,424
4Feb 23, 2026 18:394,41960,691,17135,657,0001,018,0002,486,272
5Feb 23, 2026 18:404,43762,124,47334,834,0001,990,0002,273,280
6Feb 23, 2026 18:394,49459,096,38436,291,0001,008,0002,535,424