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 listAug 4, 2026 08:31Teow Hua JunTeow Hua JunScore: 6,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:316,28262,163,80951,014,0001,128,0002,113,536
2Aug 4, 2026 08:316,29562,375,05751,116,0001,139,0002,113,536
3Aug 4, 2026 08:316,29862,279,63851,156,0001,119,0002,113,536
4Aug 4, 2026 08:316,35762,771,25351,649,0001,122,0002,113,536
5Aug 4, 2026 08:316,35862,726,67851,666,0001,107,0002,113,536
6Aug 4, 2026 08:316,36162,788,67751,683,0001,120,0002,113,536
7Aug 4, 2026 08:316,36362,838,97151,700,0001,116,0002,113,536
8Aug 4, 2026 08:316,37162,964,17151,751,0001,131,0002,113,536
9Aug 4, 2026 08:316,37762,992,14951,805,0001,132,0002,113,536