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 listMay 11, 2026 22:08flavio87flavio87Score: 7,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 22:087,04165,723,33457,431,0001,015,0002,113,536
2May 11, 2026 22:087,05968,724,90257,579,0001,014,0002,113,536
3May 11, 2026 22:087,06067,672,74257,592,0001,014,0002,113,536
4May 11, 2026 22:087,11566,449,10158,041,0001,015,0002,113,536
5May 11, 2026 22:087,12268,173,20757,064,0002,051,0002,113,536
6May 11, 2026 22:087,19668,917,04958,713,0001,015,0002,113,536
7May 11, 2026 22:087,27369,806,03159,350,0001,017,0002,113,536
8May 11, 2026 22:087,27669,509,48559,377,0001,014,0002,113,536
9May 11, 2026 22:087,37569,858,95460,203,0001,014,0002,113,536