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 9, 2026 16:49nunnunScore: 369,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 16:49368,3993,084,258,0462,990,742,00066,971,0002,351,104
2Feb 9, 2026 16:49368,8383,084,800,3872,999,389,00061,966,0002,281,472
3Feb 9, 2026 16:49368,9663,086,831,0372,992,453,00069,963,0002,281,472
4Feb 9, 2026 16:49369,5683,090,148,9542,993,457,00073,961,0002,289,664
5Feb 9, 2026 16:49369,6493,099,227,4532,988,114,00079,976,0002,281,472
6Feb 9, 2026 16:49370,3013,098,268,7682,998,533,00074,963,0002,289,664
7Feb 9, 2026 16:49370,4823,099,068,2773,002,021,00072,976,0002,281,472
8Feb 9, 2026 16:49371,9843,117,691,8113,030,497,00056,971,0002,363,392
9Feb 9, 2026 16:49376,6343,158,773,9233,067,078,00058,982,0002,289,664