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 15, 2026 23:14marko1597marko1597Score: 6,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:336,05560,217,73349,128,0001,130,0002,113,536
2Aug 15, 2026 23:336,05660,532,10849,111,0001,154,0002,113,536
3Aug 15, 2026 23:336,05860,319,76749,142,0001,141,0002,113,536
4Aug 15, 2026 23:336,05960,230,58149,148,0001,149,0002,113,536
5Aug 15, 2026 23:336,06261,039,42749,150,0001,165,0002,113,536
6Aug 15, 2026 23:336,19961,516,49150,301,0001,157,0002,113,536
7Aug 15, 2026 23:336,23761,753,86650,627,0001,141,0002,113,536
8Aug 15, 2026 23:336,24861,929,11650,695,0001,164,0002,113,536
9Aug 15, 2026 23:336,27762,148,45550,946,0001,155,0002,113,536