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 listNov 1, 2026 05:43timothygktimothygkScore: 10,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 05:4810,38497,084,96567,844,00018,347,0002,150,400stderr
2Nov 1, 2026 05:4810,40997,319,60266,936,00019,462,00053,248stderr
3Nov 1, 2026 05:4810,47297,863,42567,213,00019,712,0002,150,400stderr
4Nov 1, 2026 05:4810,58099,360,76567,454,00020,364,0002,150,400stderr
5Nov 1, 2026 05:4810,58798,777,68867,082,00020,797,0002,150,400stderr
6Nov 1, 2026 05:4810,67899,480,65869,361,00019,268,0002,150,400stderr
7Nov 1, 2026 05:4810,868101,427,50171,739,00018,466,0002,150,400stderr
8Nov 1, 2026 05:4810,901101,228,50271,901,00018,585,0002,150,400stderr
9Nov 1, 2026 05:4810,956101,864,95472,113,00018,829,00053,248stderr