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 listOct 22, 2026 16:53timothygktimothygkScore: 15,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:5315,344138,396,19597,778,00029,578,0002,117,632stderr
2Oct 22, 2026 16:5315,426139,017,20398,144,00029,896,0002,117,632stderr
3Oct 22, 2026 16:5315,456139,314,79098,324,00029,962,0002,117,632stderr
4Oct 22, 2026 16:5315,458139,824,48398,658,00029,651,0002,117,632stderr
5Oct 22, 2026 16:5315,474139,878,27998,299,00030,139,0002,117,632stderr
6Oct 22, 2026 16:5315,528140,214,40298,734,00030,151,0002,117,632stderr
7Oct 22, 2026 16:5315,656141,407,009100,001,00029,944,0002,117,632stderr
8Oct 22, 2026 16:5315,721142,062,347100,058,00030,433,0002,117,632stderr
9Oct 22, 2026 16:5315,746142,128,22999,705,00030,994,0002,117,632stderr