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 12, 2026 00:51Victor MerckléVictor MerckléScore: 3,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 00:523,82940,254,56930,747,0001,041,0002,117,632stderr
2Aug 12, 2026 00:523,84340,983,23430,734,0001,163,0002,117,632stderr
3Aug 12, 2026 00:523,85340,391,60130,819,0001,165,0002,117,632stderr
4Aug 12, 2026 00:523,87240,550,03830,980,0001,163,0002,117,632stderr
5Aug 12, 2026 00:523,87340,583,97831,020,0001,127,0002,117,632stderr
6Aug 12, 2026 00:523,92140,937,51831,503,0001,047,0002,117,632stderr
7Aug 12, 2026 00:523,99341,566,84332,075,0001,072,0002,117,632stderr
8Aug 12, 2026 00:524,11642,564,31933,122,0001,046,0002,117,632stderr
9Aug 12, 2026 00:524,15342,870,35633,424,0001,050,0002,117,632stderr