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 1, 2026 13:28George SeabridgeGeorge SeabridgeScore: 8,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:287,18669,637,62158,638,0001,006,0002,113,536
2Aug 1, 2026 13:287,22670,308,14258,894,0001,082,0002,113,536
3Aug 1, 2026 13:287,71174,078,96962,910,0001,093,0002,113,536
4Aug 1, 2026 13:288,62781,603,84770,517,0001,095,0002,113,536
5Aug 1, 2026 13:288,63681,768,53370,554,0001,129,0002,113,536
6Aug 1, 2026 13:288,65581,775,32270,754,0001,086,0002,113,536
7Aug 1, 2026 13:288,67982,001,68470,943,0001,097,0002,113,536
8Aug 1, 2026 13:288,68782,106,09971,019,0001,089,0002,113,536
9Aug 1, 2026 13:288,70882,283,15671,172,0001,109,0002,113,536