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 listFeb 4, 2026 13:16GlennGlennScore: 2,068,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2026 13:162,064,65917,171,807,94217,069,697,00066,971,0002,293,760
2Feb 4, 2026 13:162,065,76817,180,907,93717,087,905,00057,972,0002,523,136
3Feb 4, 2026 13:162,066,42117,185,348,57717,090,323,00060,972,0002,281,472
4Feb 4, 2026 13:162,066,93417,186,045,93817,081,582,00073,967,0002,281,472
5Feb 4, 2026 13:162,068,05517,196,968,88317,102,887,00061,966,0002,281,472
6Feb 4, 2026 13:162,068,93617,208,141,87817,107,198,00064,970,0002,281,472
7Feb 4, 2026 13:162,069,18517,203,982,68917,108,269,00065,970,0002,281,472
8Feb 4, 2026 13:162,069,73817,213,512,44317,103,861,00074,968,0002,289,664
9Feb 4, 2026 13:162,084,58217,331,886,05117,240,062,00061,971,0002,281,472