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 09:44Karthik ReddyKarthik ReddyError
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 09:4404,089,590,4741,061,579,00018,810,0002,113,536expected "53683080646576575 ", got " real26550 uni25735 real25660 uni25708 real25685 uni25708 real26527 hot25508 real25690 hot25471 real25683 hot25493 "
2Oct 5, 2026 09:4404,089,286,8541,061,164,00018,771,0002,113,536expected "53689224828886462 ", got " real26395 uni25680 real25540 uni25655 real25515 uni25658 real26400 hot25393 real25573 hot25408 real25570 hot25388 "
3Oct 5, 2026 09:4404,089,454,8531,061,337,00019,069,0002,113,536expected "53684064764822855 ", got " real26465 uni25765 real25650 uni25760 real25633 uni25768 real26490 hot25461 real25643 hot25503 real25680 hot25503 "