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 21:38Josu San MartinJosu San MartinScore: 25,979Success
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 21:3825,870224,052,511155,073,00059,649,0002,113,536
2Jul 3, 2026 21:3825,874224,055,822155,631,00059,124,0002,113,536
3Jul 3, 2026 21:3825,888224,226,839155,217,00059,657,0002,113,536
4Jul 3, 2026 21:3825,977225,182,376155,402,00060,215,0002,113,536
5Jul 3, 2026 21:3825,979224,934,463155,233,00060,398,0002,113,536
6Jul 3, 2026 21:3826,032225,436,361155,703,00060,365,0002,113,536
7Jul 3, 2026 21:3826,060225,688,784155,374,00060,932,0002,113,536
8Jul 3, 2026 21:3826,066225,747,931155,526,00060,823,0002,113,536
9Jul 3, 2026 21:3826,145226,414,355155,535,00061,469,0002,113,536