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 listFeb 19, 2026 20:39wnwnScore: 5,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:395,07062,533,19340,076,0002,003,0002,486,272
2Feb 19, 2026 20:395,09567,248,58740,279,0002,013,0002,490,368
3Feb 19, 2026 20:395,10067,277,20140,314,0002,015,0002,498,560
4Feb 19, 2026 20:395,10164,966,22941,334,0001,008,0002,498,560
5Feb 19, 2026 20:395,11068,230,37941,405,0001,009,0002,494,464
6Feb 19, 2026 20:395,13074,833,36641,564,0001,013,0002,494,464