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 listJan 9, 2026 18:51AVGAVGScore: 42,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:5142,865379,589,552353,782,0001,998,0002,273,280
2Jan 9, 2026 18:5142,891378,935,634352,994,0002,999,0002,269,184
3Jan 9, 2026 18:5142,897379,383,928355,043,0001,000,0002,269,184
4Jan 9, 2026 18:5142,897381,990,427355,045,0001,000,0002,269,184
5Jan 9, 2026 18:5142,905379,295,387354,111,0002,000,0002,400,256
6Jan 9, 2026 18:5142,911377,724,060354,160,0002,000,0002,396,160
7Jan 9, 2026 18:5142,927381,119,542354,296,0002,001,0002,519,040
8Jan 9, 2026 18:5142,942382,985,301354,418,0002,002,0002,269,184
9Jan 9, 2026 18:5142,943380,975,500354,423,0002,002,0002,269,184