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 listJul 3, 2026 18:57Josu San MartinJosu San MartinScore: 27,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:5727,455237,398,796223,006,0004,873,0002,113,536
2Jul 3, 2026 18:5727,486237,584,032223,293,0004,845,0002,113,536
3Jul 3, 2026 18:5727,565238,214,328224,051,0004,746,0002,113,536
4Jul 3, 2026 18:5727,600238,470,225224,972,0004,109,0002,113,536
5Jul 3, 2026 18:5727,600238,511,252224,347,0004,736,0002,113,536
6Jul 3, 2026 18:5727,612238,526,725224,513,0004,673,0002,113,536
7Jul 3, 2026 18:5727,633238,751,609224,599,0004,759,0002,113,536
8Jul 3, 2026 18:5727,641238,899,163224,577,0004,851,0002,113,536
9Jul 3, 2026 18:5727,768239,921,258225,825,0004,657,0002,113,536