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 listApr 27, 2026 05:42wnwnScore: 3,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:443,40742,525,32527,271,0001,010,0002,486,272
2Apr 27, 2026 05:443,44842,694,93327,598,0001,022,0002,486,272
3Apr 27, 2026 05:443,45642,001,12026,708,0001,978,0002,490,368
4Apr 27, 2026 05:443,46244,479,44626,754,0001,981,0002,486,272
5Apr 27, 2026 05:443,48241,708,03626,910,0001,993,0002,314,240
6Apr 27, 2026 05:443,52145,222,36128,221,0001,007,0002,482,176
7Apr 27, 2026 05:443,53045,780,06628,292,0001,010,0002,482,176
8Apr 27, 2026 05:443,59949,365,24727,883,0001,991,0002,490,368
9Apr 27, 2026 05:443,62146,705,71828,056,0002,004,0002,486,272