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 listMar 1, 2025 23:15PhibPhibScore: 42,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 23:1542,558382,499,615351,231,0002,001,0002,281,472
2Mar 1, 2025 23:1542,581380,883,514352,423,0001,001,0002,281,472
3Mar 1, 2025 23:1542,586381,787,012352,460,0001,001,0002,506,752
4Mar 1, 2025 23:1542,592380,048,475351,515,0002,002,0002,502,656
5Mar 1, 2025 23:1542,603380,402,222351,611,0001,997,0002,506,752
6Mar 1, 2025 23:1542,609378,928,543350,661,0002,997,0002,334,720
7Mar 1, 2025 23:1542,609388,167,822351,658,0001,998,0002,281,472
8Mar 1, 2025 23:1542,614382,084,476350,698,0002,997,0002,281,472
9Mar 1, 2025 23:1542,615379,726,281351,709,0001,998,0002,281,472