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 26, 2026 21:07Victor MerckléVictor MerckléScore: 4,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:083,90541,456,53131,301,0001,112,0002,113,536
2Aug 26, 2026 21:083,90940,891,05831,281,0001,169,0002,113,536
3Aug 26, 2026 21:083,94241,110,23731,600,0001,123,0002,113,536
4Aug 26, 2026 21:083,95141,215,14331,563,0001,238,0002,113,536
5Aug 26, 2026 21:084,09342,118,67632,791,0001,184,0002,113,536
6Aug 26, 2026 21:084,12243,318,59733,150,0001,063,0002,113,536
7Aug 26, 2026 21:084,20243,902,59233,825,0001,056,0002,113,536
8Aug 26, 2026 21:084,23544,212,48234,120,0001,033,0002,113,536
9Aug 26, 2026 21:084,24843,595,14734,232,0001,028,0002,113,536