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 29, 2026 18:48Victor MerckléVictor MerckléScore: 4,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 18:494,53845,358,09036,519,0001,152,0002,117,632stderr
2Jun 29, 2026 18:494,55245,510,39536,668,0001,115,0002,117,632stderr
3Jun 29, 2026 18:494,56645,713,73536,838,0001,060,0002,117,632stderr
4Jun 29, 2026 18:494,56845,639,76936,882,0001,040,0002,117,632stderr
5Jun 29, 2026 18:494,57445,677,40136,866,0001,100,0002,117,632stderr
6Jun 29, 2026 18:494,59645,809,61437,104,0001,051,0002,117,632stderr
7Jun 29, 2026 18:494,60945,957,17137,219,0001,037,0002,117,632stderr
8Jun 29, 2026 18:494,63246,092,79537,418,0001,032,0002,117,632stderr
9Jun 29, 2026 18:494,66546,405,20737,595,0001,129,0002,117,632stderr