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 22, 2026 10:59wnwnScore: 3,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:593,42647,349,78427,427,0001,015,0002,486,272
2Apr 22, 2026 10:593,45146,909,52427,622,0001,023,0002,490,368
3Apr 22, 2026 10:593,47141,552,75026,826,0001,987,0002,326,528
4Apr 22, 2026 10:593,48147,579,32326,903,0001,992,0002,490,368
5Apr 22, 2026 10:593,49744,076,48727,030,0002,002,0002,482,176
6Apr 22, 2026 10:593,56946,591,24828,602,0001,021,0002,486,272
7Apr 22, 2026 10:593,59948,800,93127,886,0001,991,0002,486,272
8Apr 22, 2026 10:593,62651,477,02028,097,0002,006,0002,494,464
9Apr 22, 2026 10:593,69648,578,09630,684,00002,330,624