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 10, 2026 10:00Danylo MocherniukDanylo MocherniukScore: 19,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:0019,438190,041,735158,328,0003,006,0002,383,872
2Apr 10, 2026 10:0019,439190,361,309159,339,0002,004,0002,379,776
3Apr 10, 2026 10:0119,451190,997,703159,435,0002,005,0002,297,856
4Apr 10, 2026 10:0019,453182,683,394160,454,0001,002,0002,297,856
5Apr 10, 2026 10:0119,458194,318,022159,498,0002,006,0002,297,856
6Apr 10, 2026 10:0019,464187,512,103159,546,0002,006,0002,400,256
7Apr 10, 2026 10:0019,466189,324,774159,564,0002,007,0002,387,968
8Apr 10, 2026 10:0019,477184,992,319160,664,000997,0002,297,856
9Apr 10, 2026 10:0019,490184,665,944159,769,0001,997,0002,392,064
10Apr 10, 2026 10:0019,654189,025,822160,123,0003,002,0002,387,968
11Apr 10, 2026 10:0019,862192,052,914162,858,0001,998,0002,383,872
12Apr 10, 2026 10:0120,073193,736,432164,603,0002,007,0002,351,104