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 listMar 8, 2026 08:31caandocaandoScore: 9,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 08:318,44592,936,45068,089,0002,002,0002,269,184
2Mar 8, 2026 08:318,45895,484,89368,196,0002,005,0002,281,472
3Mar 8, 2026 08:318,46895,156,00068,280,0002,008,0002,527,232
4Mar 8, 2026 08:319,378104,775,24275,839,0001,995,0002,281,472
5Mar 8, 2026 08:319,41399,463,10978,124,00002,281,472
6Mar 8, 2026 08:319,435102,073,21377,307,0001,003,0002,273,280