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 15, 2026 02:38zayd-ansari-codezayd-ansari-codeScore: 89,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 02:3988,981749,134,398679,913,00058,631,0002,113,536
2Oct 15, 2026 02:3989,031749,905,949679,741,00059,219,0002,113,536
3Oct 15, 2026 02:3989,053750,229,178680,362,00058,780,0002,113,536