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 listMar 13, 2026 14:37Hung T.NguyenHung T.NguyenScore: 43,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:3743,117384,771,030356,872,000999,0002,408,448
2Mar 13, 2026 14:3743,118380,260,243353,883,0003,998,0002,400,256
3Mar 13, 2026 14:3743,119383,782,167356,886,000999,0002,392,064
4Mar 13, 2026 14:3743,123380,279,636356,919,000999,0002,396,160
5Mar 13, 2026 14:3743,124389,510,037356,931,000999,0002,265,088
6Mar 13, 2026 14:3743,125381,595,741356,935,000999,0002,265,088
7Mar 13, 2026 14:3743,126379,874,199356,949,000999,0002,387,968
8Mar 13, 2026 14:3743,128380,489,483355,962,0001,999,0002,387,968
9Mar 13, 2026 14:3743,148378,275,727355,128,0003,001,0002,265,088