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 18, 2026 00:25Daniel MastalerzDaniel MastalerzScore: 6,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:256,25275,857,27047,898,0003,991,0002,273,280
2Feb 18, 2026 00:256,25685,116,13847,930,0003,994,0002,379,776
3Feb 18, 2026 00:256,25777,146,19047,937,0003,994,0002,269,184
4Feb 18, 2026 00:256,25975,648,75647,956,0003,996,0002,326,528
5Feb 18, 2026 00:256,26475,671,13147,994,0003,999,0002,269,184
6Feb 18, 2026 00:256,27075,494,50048,035,0004,002,0002,326,528
7Feb 18, 2026 00:256,27681,354,12148,084,0004,007,0002,310,144
8Feb 18, 2026 00:256,27776,466,64348,089,0004,007,0002,265,088
9Feb 18, 2026 00:256,65883,033,92253,252,0002,009,0002,310,144