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 10:57RuszrokRuszrokScore: 258,812Success
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:00257,9242,168,152,9682,139,767,000999,0002,289,664
2Feb 3, 2026 11:00258,6992,171,698,7782,145,206,0001,999,0002,363,392
3Feb 3, 2026 10:57258,7842,174,456,2682,146,909,000999,0002,363,392
4Feb 3, 2026 10:57258,8122,173,434,6182,146,137,0001,999,0002,289,664
5Feb 3, 2026 11:00258,8722,175,476,7052,148,636,00002,285,568
6Feb 3, 2026 10:57259,1292,185,094,4422,149,768,000999,0002,285,568