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 2, 2026 20:21George SeabridgeGeorge SeabridgeScore: 5,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:215,58156,317,80444,047,0002,280,0002,113,536
2Aug 2, 2026 20:215,58156,255,33444,054,0002,272,0002,113,536
3Aug 2, 2026 20:215,59556,365,39944,182,0002,263,0002,113,536
4Aug 2, 2026 20:215,59856,381,65944,186,0002,281,0002,113,536
5Aug 2, 2026 20:215,60256,404,66044,186,0002,316,0002,113,536
6Aug 2, 2026 20:215,61456,591,36943,354,0003,249,0002,113,536
7Aug 2, 2026 20:215,62366,282,00044,452,0002,220,0002,117,632
8Aug 2, 2026 20:215,65667,374,25343,899,0003,049,0002,113,536
9Aug 2, 2026 20:215,81967,998,26645,253,0003,050,0002,113,536