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 27, 2025 01:24Marco BarboneMarco BarboneScore: 1,249,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 01:241,245,72710,369,058,42610,273,566,00065,971,0002,277,376
2Jul 27, 2025 01:241,248,91710,393,528,88810,312,039,00053,974,0002,289,664
3Jul 27, 2025 01:241,248,95510,400,532,11510,299,359,00066,969,0002,289,664
4Jul 27, 2025 01:241,249,14910,398,355,42610,303,969,00063,968,0002,379,776
5Jul 27, 2025 01:241,249,62010,404,385,73610,291,892,00079,952,0002,277,376
6Jul 27, 2025 01:241,250,46610,406,862,92210,310,898,00067,966,0002,285,568
7Jul 27, 2025 01:241,251,83910,417,881,93110,334,286,00055,974,0002,277,376
8Jul 27, 2025 01:241,254,52810,439,892,12710,337,611,00074,968,0002,285,568
9Jul 27, 2025 01:241,284,21010,691,001,00110,554,982,000103,960,0002,277,376