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 10, 2026 17:21Daniel MastalerzDaniel MastalerzScore: 8,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 17:218,45992,250,51165,198,0005,015,0002,387,968
2Feb 10, 2026 17:218,49092,942,49366,437,0004,026,0002,314,240
3Feb 10, 2026 17:218,55795,592,98866,020,0005,001,0002,318,336
4Feb 10, 2026 17:218,61894,767,32570,526,0001,007,0002,297,856
5Feb 10, 2026 17:218,62797,816,58968,583,0003,025,0002,408,448
6Feb 10, 2026 17:218,65096,699,00968,806,0002,991,0002,342,912