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 1, 2026 20:27leoweleoweScore: 2,069,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:272,067,19117,194,953,20017,096,727,00060,959,0002,281,472
2Apr 1, 2026 20:272,067,19917,188,446,92317,098,783,00058,971,0002,281,472
3Apr 1, 2026 20:272,068,06217,194,595,40717,106,946,00057,972,0002,281,472
4Apr 1, 2026 20:272,069,13717,213,467,66817,099,879,00073,960,0002,281,472
5Apr 1, 2026 20:272,069,26217,210,946,51117,113,906,00060,967,0002,281,472
6Apr 1, 2026 20:272,070,56917,221,286,39417,114,764,00070,957,0002,281,472
7Apr 1, 2026 20:272,073,32117,261,738,65317,133,625,00074,941,0002,281,472
8Apr 1, 2026 20:272,080,69317,301,147,42417,190,786,00078,966,0002,281,472
9Apr 1, 2026 20:272,091,59617,392,277,80217,291,274,00068,969,0002,289,664