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 listOct 5, 2026 03:33FrederickFrederickScore: 12,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 03:3312,323113,414,926100,267,0002,021,0002,117,632
2Oct 5, 2026 03:3312,388113,246,414100,815,0002,008,0002,117,632
3Oct 5, 2026 03:3312,437113,704,236101,202,0002,028,0002,117,632
4Oct 5, 2026 03:3312,457114,500,492101,379,0002,018,0002,117,632
5Oct 5, 2026 03:3312,543115,450,611102,066,0002,048,0002,117,632
6Oct 5, 2026 03:3312,555115,349,768102,208,0002,004,0002,113,536
7Oct 5, 2026 03:3312,714116,695,587103,498,0002,029,0002,117,632
8Oct 5, 2026 03:3312,828117,678,792104,435,0002,044,0002,117,632
9Oct 5, 2026 03:3312,887118,146,623104,949,0002,018,0002,117,632