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 11:18Andrew EpsteinAndrew EpsteinScore: 16,251Success
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 11:1916,211144,211,493133,549,0001,009,00024,576stderr
2Nov 3, 2026 11:1916,214143,846,974133,546,0001,034,00024,576stderr
3Nov 3, 2026 11:1916,220143,932,086133,617,0001,012,00024,576stderr
4Nov 3, 2026 11:1916,242144,452,321133,802,0001,010,00024,576stderr
5Nov 3, 2026 11:1916,251144,241,196133,879,0001,005,00024,576stderr
6Nov 3, 2026 11:1916,258144,210,516133,935,0001,013,00024,576stderr
7Nov 3, 2026 11:1916,263144,345,045133,963,0001,025,00024,576stderr
8Nov 3, 2026 11:1916,299144,549,652134,248,0001,034,00024,576stderr
9Nov 3, 2026 11:1916,323144,825,243134,463,0001,026,00024,576stderr