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 27, 2026 11:16Victor MerckléVictor MerckléScore: 4,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 11:174,13342,428,20333,079,0001,225,0002,113,536
2Aug 27, 2026 11:174,14342,614,77333,327,0001,062,0002,113,536
3Aug 27, 2026 11:174,24444,272,69734,095,0001,135,0002,113,536
4Aug 27, 2026 11:174,25943,542,48434,246,0001,109,0002,113,536
5Aug 27, 2026 11:174,26143,574,85834,223,0001,150,0002,113,536
6Aug 27, 2026 11:174,26943,671,16534,257,0001,180,0002,113,536
7Aug 27, 2026 11:174,30143,859,67734,533,0001,173,0002,113,536
8Aug 27, 2026 11:174,36945,931,62335,182,0001,081,0002,113,536
9Aug 27, 2026 11:174,48245,612,22336,125,0001,083,0002,113,536