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 15:42TudyMTudyMScore: 36,894Success
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 15:4636,877322,357,258304,080,0002,000,0002,375,680
2Apr 26, 2026 15:4636,886323,462,807305,158,0001,000,0002,375,680
3Apr 26, 2026 15:4636,886320,618,206304,159,0002,001,0002,375,680
4Apr 26, 2026 15:4636,894320,841,710305,227,0001,000,0002,379,776
5Apr 26, 2026 15:4636,894323,816,553306,223,00002,387,968
6Apr 26, 2026 15:4636,896325,931,014304,240,0002,001,0002,392,064
7Apr 26, 2026 15:4636,910325,999,554305,352,0001,001,0002,383,872
8Apr 26, 2026 15:4636,910326,362,756305,353,0001,001,0002,379,776
9Apr 26, 2026 15:4636,916322,515,047305,408,0001,001,0002,383,872