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 listApr 3, 2026 08:03SODIUM IS NOT A CATSODIUM IS NOT A CATScore: 68,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 08:0367,807586,401,282504,817,00057,979,0002,265,088
2Apr 3, 2026 08:0367,821584,693,836494,925,00067,989,0002,273,280
3Apr 3, 2026 08:0367,920585,751,297483,770,00079,962,0002,289,664
4Apr 3, 2026 08:0367,974590,728,948506,163,00058,018,0002,289,664
5Apr 3, 2026 08:0368,004591,743,078489,511,00074,925,0002,289,664
6Apr 3, 2026 08:0368,007594,767,061503,519,00060,941,0002,519,040
7Apr 3, 2026 08:0368,050590,973,697501,838,00062,979,0002,289,664
8Apr 3, 2026 08:0368,088589,898,690496,113,00069,015,0002,289,664
9Apr 3, 2026 08:0368,198593,730,781490,037,00076,005,0002,289,664