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 21, 2026 02:39Andrew EpsteinAndrew EpsteinScore: 4,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 02:393,88642,182,19729,982,0002,272,0002,113,536
2Aug 21, 2026 02:393,90942,320,55730,192,0002,257,0002,113,536
3Aug 21, 2026 02:393,97342,805,64530,703,0002,274,0002,113,536
4Aug 21, 2026 02:393,99042,771,29330,840,0002,283,0002,113,536
5Aug 21, 2026 02:394,02343,128,21831,122,0002,276,0002,113,536
6Aug 21, 2026 02:394,03343,234,38231,194,0002,280,0002,113,536
7Aug 21, 2026 02:394,03343,198,49031,203,0002,279,0002,113,536
8Aug 21, 2026 02:394,04443,372,27531,294,0002,273,0002,113,536
9Aug 21, 2026 02:394,09443,790,46031,708,0002,276,0002,113,536