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 19, 2026 14:02Victor MerckléVictor MerckléScore: 6,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:036,01357,682,73248,892,0001,022,0002,113,536
2May 19, 2026 14:036,02559,076,38749,000,0001,013,0002,113,536
3May 19, 2026 14:036,03059,569,67049,047,0001,007,0002,113,536
4May 19, 2026 14:036,13960,845,41249,947,0001,013,0002,113,536
5May 19, 2026 14:036,20362,085,54550,460,0001,031,0002,113,536
6May 19, 2026 14:036,20762,246,65350,488,0001,037,0002,113,536
7May 19, 2026 14:036,21961,025,76450,601,0001,018,0002,113,536
8May 19, 2026 14:036,22160,988,32050,610,0001,027,0002,113,536
9May 19, 2026 14:036,29261,382,43151,092,0001,134,0002,113,536