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 3, 2026 02:09Andrew EpsteinAndrew EpsteinScore: 57,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 02:1757,609487,643,557476,152,0002,005,0002,121,728stderr
2Nov 3, 2026 02:1757,702488,291,034476,915,0002,012,0002,121,728stderr
3Nov 3, 2026 02:1757,706488,220,154476,956,0002,007,0002,121,728stderr
4Nov 3, 2026 02:1757,734488,800,328477,185,0002,010,0002,121,728stderr
5Nov 3, 2026 02:1757,894490,251,118478,521,0002,006,0002,121,728stderr
6Nov 3, 2026 02:1757,902489,923,583478,581,0002,010,0002,121,728stderr
7Nov 3, 2026 02:1757,927490,035,899478,781,0002,018,0002,121,728stderr
8Nov 3, 2026 02:1757,931490,335,526478,825,0002,008,0002,121,728stderr
9Nov 3, 2026 02:1760,016516,022,690496,076,0002,059,0002,121,728stderr