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 18:39Victor MerckléVictor MerckléScore: 3,846Success
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 18:393,83940,200,22429,560,0002,307,0002,113,536
2Aug 27, 2026 18:393,84240,296,63829,591,0002,301,0002,113,536
3Aug 27, 2026 18:393,84640,359,15229,592,0002,337,0002,113,536
4Aug 27, 2026 18:393,84640,401,78529,650,0002,272,0002,113,536
5Aug 27, 2026 18:393,84640,955,22029,516,0002,407,0002,113,536
6Aug 27, 2026 18:393,85042,469,15529,642,0002,318,0002,113,536
7Aug 27, 2026 18:393,99942,224,25730,966,0002,231,0002,113,536
8Aug 27, 2026 18:394,00342,087,64131,049,0002,180,0002,113,536
9Aug 27, 2026 18:394,09442,350,72331,598,0002,383,0002,113,536