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 2, 2025 03:25Tan Lip WeiTan Lip WeiScore: 39,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 03:2639,940359,956,045320,515,00010,983,0002,445,312
2Nov 2, 2025 03:2639,942364,215,452319,535,00011,982,0002,400,256
3Nov 2, 2025 03:2539,976356,765,812320,811,00010,993,0002,314,240
4Nov 2, 2025 03:2639,994359,168,121322,953,0008,998,0002,301,952
5Nov 2, 2025 03:2540,012362,981,801321,098,00011,003,0002,338,816
6Nov 2, 2025 03:2540,122356,547,739322,016,00011,000,0002,392,064