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 5, 2026 07:54M-RochatM-RochatScore: 35,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:5534,971308,441,282289,215,0001,045,0002,351,104
2May 5, 2026 07:5534,973307,187,813289,249,0001,032,0002,355,200
3May 5, 2026 07:5535,004308,542,386289,455,0001,086,0002,351,104
4May 5, 2026 07:5535,146309,074,174290,664,0001,054,0002,363,392
5May 5, 2026 07:5535,163308,506,117290,810,0001,049,0002,342,912
6May 5, 2026 07:5535,202309,240,233291,137,0001,041,0002,351,104
7May 5, 2026 07:5535,286311,605,561291,816,0001,060,0002,367,488
8May 5, 2026 07:5535,294313,231,258291,906,0001,039,0002,342,912
9May 5, 2026 07:5535,495314,910,261293,526,0001,089,0002,355,200