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 26, 2026 16:12TudyMTudyMScore: 35,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:1234,997308,806,884288,480,0002,003,0002,383,872
2Apr 26, 2026 16:1235,012307,193,927287,611,0002,995,0002,379,776
3Apr 26, 2026 16:1235,015307,222,110288,629,0001,997,0002,383,872
4Apr 26, 2026 16:1235,016316,006,732287,645,0002,996,0002,379,776
5Apr 26, 2026 16:1235,020304,888,917288,670,0002,004,0002,375,680
6Apr 26, 2026 16:1235,025310,045,913288,713,0001,998,0002,383,872
7Apr 26, 2026 16:1235,033305,344,749287,782,0002,997,0002,445,312
8Apr 26, 2026 16:1235,042310,202,199287,852,0002,998,0002,379,776
9Apr 26, 2026 16:1235,042307,150,968287,858,0002,998,0002,445,312