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 listDec 27, 2025 22:00Josu San MartinJosu San MartinScore: 31,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 22:0031,338287,089,576258,108,0002,000,0002,363,392
2Dec 27, 2025 22:0031,436288,111,563258,923,0001,999,0002,355,200
3Dec 27, 2025 22:0031,443288,673,589259,981,000999,0002,355,200
4Dec 27, 2025 22:0031,975288,724,829265,395,00002,289,664
5Dec 27, 2025 22:0031,985296,465,889264,472,0001,001,0002,355,200
6Dec 27, 2025 22:0031,990294,632,798265,520,00002,289,664
7Dec 27, 2025 22:0031,995292,160,044264,556,0001,002,0002,363,392
8Dec 27, 2025 22:0032,012290,985,641264,705,000998,0002,289,664
9Dec 27, 2025 22:0032,017293,352,033264,739,000999,0002,371,584