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 listSep 24, 2026 12:01wnwnScore: 3,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 12:013,31236,306,35826,473,0001,021,0002,113,536
2Sep 24, 2026 12:013,31236,125,45426,467,0001,029,0002,113,536
3Sep 24, 2026 12:013,31936,283,77226,532,0001,023,0002,113,536
4Sep 24, 2026 12:013,33436,476,73226,636,0001,043,0002,113,536
5Sep 24, 2026 12:013,34736,550,52926,783,0001,004,0002,113,536
6Sep 24, 2026 12:013,38736,670,34327,109,0001,010,0002,113,536
7Sep 24, 2026 12:013,45038,074,83827,602,0001,035,0002,113,536
8Sep 24, 2026 12:013,45337,255,53327,627,0001,041,0002,113,536
9Sep 24, 2026 12:013,47138,246,14427,782,0001,033,0002,113,536