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 listFeb 16, 2026 20:50wnwnScore: 8,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 20:507,58082,162,58359,915,0002,995,0002,486,272
2Feb 16, 2026 20:507,64983,854,89560,462,0003,023,0002,506,752
3Feb 16, 2026 20:507,73090,814,86562,154,0002,004,0002,486,272
4Feb 16, 2026 20:508,56597,715,33168,085,0003,003,0002,453,504
5Feb 16, 2026 20:508,57298,387,06670,146,0001,002,0002,416,640
6Feb 16, 2026 20:508,60594,252,13468,403,0003,017,0002,387,968
7Feb 16, 2026 20:508,740104,530,46669,519,0003,022,0002,396,160
8Feb 16, 2026 20:508,81296,855,26970,134,0003,005,0002,453,504
9Feb 16, 2026 20:509,007101,393,50971,771,0002,990,0002,437,120