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 3, 2026 03:41CheckHarryCheckHarryScore: 5,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:425,96259,364,87448,316,0001,170,0002,113,536
2Sep 3, 2026 03:425,96759,417,10448,348,0001,180,0002,113,536
3Sep 3, 2026 03:425,97259,476,60648,516,0001,059,0002,113,536
4Sep 3, 2026 03:425,97459,483,83148,549,0001,040,0002,113,536
5Sep 3, 2026 03:425,97659,515,12848,547,0001,059,0002,113,536
6Sep 3, 2026 03:425,97659,506,02748,543,0001,061,0002,113,536
7Sep 3, 2026 03:425,98059,493,46848,592,0001,042,0002,113,536
8Sep 3, 2026 03:425,98459,548,44648,620,0001,051,0002,113,536
9Sep 3, 2026 03:425,98559,468,16248,628,0001,049,0002,113,536