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 09:16Tan Lip WeiTan Lip WeiScore: 10,109Success
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 09:169,540103,148,07867,153,00012,027,0002,301,952
2Nov 2, 2025 09:169,622105,221,86068,881,00010,981,0002,383,872
3Nov 2, 2025 09:169,693107,519,60768,530,00011,918,0002,379,776
4Nov 2, 2025 09:1610,109109,461,54475,911,0007,990,0002,371,584
5Nov 2, 2025 09:1610,234110,799,47974,947,0009,993,0002,379,776
6Nov 2, 2025 09:1610,365117,121,78276,023,00010,003,0002,379,776