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 listMay 7, 2026 10:26wnwnScore: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:263,38843,607,25027,071,0001,051,0002,482,176
2May 7, 2026 10:263,39144,632,01227,082,0001,070,0002,482,176
3May 7, 2026 10:263,39241,702,66627,096,0001,060,0002,486,272
4May 7, 2026 10:263,40342,236,68427,188,0001,062,0002,486,272
5May 7, 2026 10:263,41043,220,52927,073,0001,236,0002,486,272
6May 7, 2026 10:263,41245,621,72827,225,0001,099,0002,486,272
7May 7, 2026 10:263,41643,883,40227,262,0001,095,0002,490,368
8May 7, 2026 10:263,44544,718,60827,519,0001,077,0002,490,368
9May 7, 2026 10:263,52745,229,87428,191,0001,090,0002,486,272