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 listFeb 18, 2026 10:55CheckHarryCheckHarryScore: 36,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:5536,545328,635,581280,297,00023,024,0002,428,928
2Feb 18, 2026 10:5536,630335,385,107282,024,00022,001,0002,424,832
3Feb 18, 2026 10:5536,681338,114,958282,417,00022,032,0002,437,120
4Feb 18, 2026 10:5536,701331,528,285281,647,00022,971,0002,273,280
5Feb 18, 2026 10:5536,723331,409,027280,817,00023,984,0002,269,184
6Feb 18, 2026 10:5536,737331,094,991279,927,00024,993,0002,428,928
7Feb 18, 2026 10:5536,945331,620,498281,671,00024,970,0002,514,944
8Feb 18, 2026 10:5537,090332,662,208285,856,00021,988,0002,424,832
9Feb 18, 2026 10:5537,284332,191,572282,507,00026,952,0002,445,312