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 11, 2026 18:50Victor MerckléVictor MerckléScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:513,86240,446,87230,917,0001,141,0002,117,632stderr
2Aug 11, 2026 18:513,86240,464,57430,924,0001,135,0002,117,632stderr
3Aug 11, 2026 18:513,86340,528,50930,878,0001,191,0002,117,632stderr
4Aug 11, 2026 18:513,88040,606,25131,174,0001,034,0002,117,632stderr
5Aug 11, 2026 18:513,88240,658,60331,177,0001,050,0002,117,632stderr
6Aug 11, 2026 18:513,89041,765,56331,261,0001,028,0002,117,632stderr
7Aug 11, 2026 18:514,05942,035,89332,662,0001,028,0002,117,632stderr
8Aug 11, 2026 18:514,10642,546,93832,977,0001,109,0002,117,632stderr
9Aug 11, 2026 18:514,13943,363,36233,291,0001,065,0002,117,632stderr