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 16:52Josu San MartinJosu San MartinScore: 37,649Success
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 16:5237,598321,503,943311,063,0001,002,0002,113,536
2Jul 3, 2026 16:5237,621321,706,019311,253,0001,004,0002,113,536
3Jul 3, 2026 16:5237,632321,782,252311,345,0001,004,0002,113,536
4Jul 3, 2026 16:5237,645321,996,159311,452,0001,004,0002,113,536
5Jul 3, 2026 16:5237,649321,901,148311,488,0001,003,0002,113,536
6Jul 3, 2026 16:5237,655322,051,703311,537,0001,003,0002,113,536
7Jul 3, 2026 16:5237,661322,101,195311,587,0001,005,0002,113,536
8Jul 3, 2026 16:5237,675323,398,465311,698,0001,005,0002,113,536
9Jul 3, 2026 16:5237,720322,474,125312,074,0001,003,0002,113,536