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 listJul 15, 2026 00:11Andrew TsibinAndrew TsibinScore: 4,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:114,83649,785,58139,002,0001,145,0002,113,536
2Jul 15, 2026 00:114,94850,670,11039,984,0001,086,0002,113,536
3Jul 15, 2026 00:114,95950,821,89840,077,0001,086,0002,113,536
4Jul 15, 2026 00:114,97950,894,45340,256,0001,076,0002,113,536
5Jul 15, 2026 00:114,98151,067,68340,191,0001,159,0002,113,536
6Jul 15, 2026 00:114,99851,008,95240,478,0001,007,0002,113,536
7Jul 15, 2026 00:115,01751,338,62640,546,0001,103,0002,113,536
8Jul 15, 2026 00:115,02151,266,90940,602,0001,079,0002,113,536
9Jul 15, 2026 00:115,04151,465,54140,777,0001,071,0002,113,536