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 17, 2026 21:23Josu San MartinJosu San MartinScore: 5,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 17, 2026 21:264,96150,981,67939,999,0001,184,0002,113,536
2Aug 17, 2026 21:264,97851,098,60340,149,0001,174,0002,113,536
3Aug 17, 2026 21:264,97951,091,82940,157,0001,171,0002,113,536
4Aug 17, 2026 21:264,98451,199,15940,359,0001,014,0002,113,536
5Aug 17, 2026 21:265,02362,487,85940,572,0001,125,0002,113,536
6Aug 17, 2026 21:265,02953,248,83640,459,0001,282,0002,113,536
7Aug 17, 2026 21:265,03361,177,14440,631,0001,148,0002,113,536
8Aug 17, 2026 21:265,24053,363,78342,482,0001,013,0002,113,536
9Aug 17, 2026 21:265,24753,266,51742,528,0001,025,0002,113,536