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 3, 2026 11:54RuszrokRuszrokScore: 101,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 11:54101,584874,824,544843,150,00002,277,376
2Feb 3, 2026 11:54101,587871,716,528843,170,00002,277,376
3Feb 3, 2026 11:54101,588873,746,518843,178,00002,277,376
4Feb 3, 2026 11:54101,588862,972,994842,182,0001,000,0002,273,280
5Feb 3, 2026 11:54101,592868,811,078843,215,00002,277,376
6Feb 3, 2026 11:54101,593870,012,171842,226,0001,000,0002,277,376
7Feb 3, 2026 11:54101,601878,243,651841,288,0001,998,0002,277,376
8Feb 3, 2026 11:54101,602872,188,580843,296,00002,277,376
9Feb 3, 2026 11:54101,682866,136,126842,959,000999,0002,273,280