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 9, 2026 16:26Oleg SkinderevOleg SkinderevScore: 76,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 16:2676,578662,809,119581,631,00053,965,0002,318,336
2Apr 9, 2026 16:2676,611656,594,814583,883,00051,989,0002,273,280
3Apr 9, 2026 16:2676,641659,763,996578,110,00058,011,0002,330,624
4Apr 9, 2026 16:2676,663661,817,407581,363,00054,939,0002,322,432
5Apr 9, 2026 16:2676,693662,166,093581,593,00054,961,0002,281,472
6Apr 9, 2026 16:2676,790670,873,395581,411,00055,943,0002,326,528
7Apr 9, 2026 16:2676,790661,661,854584,407,00052,946,0002,285,568
8Apr 9, 2026 16:2676,913666,792,135582,436,00055,945,0002,273,280
9Apr 9, 2026 16:2676,930660,661,785583,561,00054,958,0002,273,280