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 listAug 16, 2026 07:13marko1597marko1597Score: 127,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 07:29126,4891,059,997,1771,048,683,0001,182,0002,117,632stderr
2Aug 16, 2026 07:29126,6511,061,993,6091,049,937,0001,272,0002,117,632stderr
3Aug 16, 2026 07:29126,8861,063,965,1451,051,909,0001,249,0002,117,632stderr
4Aug 16, 2026 07:29127,2831,066,512,6381,055,208,0001,247,0002,117,632stderr
5Aug 16, 2026 07:29127,3771,067,414,7171,056,224,0001,006,0002,117,632stderr
6Aug 16, 2026 07:29127,6571,069,625,5501,058,391,0001,164,0002,117,632stderr
7Aug 16, 2026 07:29127,9891,073,606,0721,061,312,0001,001,0002,117,632stderr
8Aug 16, 2026 07:29128,0451,072,877,4221,061,709,0001,070,0002,117,632stderr
9Aug 16, 2026 07:29128,2001,074,152,7141,063,053,0001,007,0002,117,632stderr