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 listNov 1, 2026 21:13ambarish1729ambarish1729Score: 6,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 21:136,50264,780,59849,854,0004,114,00020,480
2Nov 1, 2026 21:136,64966,118,49351,180,0004,014,00020,480
3Nov 1, 2026 21:136,72866,954,88750,463,0005,383,00020,480
4Nov 1, 2026 21:136,75367,225,90250,218,0005,834,0002,113,536
5Nov 1, 2026 21:136,85668,318,61051,260,0005,653,00020,480
6Nov 1, 2026 21:136,85768,422,72550,898,0006,016,0002,113,536
7Nov 1, 2026 21:136,86868,418,36551,040,0005,965,00020,480
8Nov 1, 2026 21:136,90768,271,95651,275,0006,056,0002,113,536
9Nov 1, 2026 21:136,97770,101,46650,421,0007,491,00020,480