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 listSep 7, 2026 19:06neel-bhavsarneel-bhavsarScore: 93,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:0693,285784,315,760695,250,00079,018,00020,480
2Sep 7, 2026 19:0693,303785,056,905695,682,00078,740,0002,113,536
3Sep 7, 2026 19:0693,345785,054,970696,688,00078,076,00020,480
4Sep 7, 2026 19:0693,368784,941,064696,243,00078,714,0002,113,536
5Sep 7, 2026 19:0693,435785,513,446696,466,00079,049,00020,480
6Sep 7, 2026 19:0693,457786,373,551696,738,00078,959,0002,113,536
7Sep 7, 2026 19:0693,489786,636,694696,683,00079,279,0002,113,536
8Sep 7, 2026 19:0693,508786,175,234697,658,00078,459,00020,480
9Sep 7, 2026 19:0693,531786,492,848697,155,00079,158,00020,480